ar X iv : n lin / 0 61 10 49 v 1 [ nl in . C G ] 2 6 N ov 2 00 6 Local cause of coherence in Boolean networks
نویسندگان
چکیده
We performed a numerical study on random Boolean networks with power-law rank outdegree distributions to find local structural cause for the emergence of high or low degree of coherence in binary state variables. The degree of randomness and coherence of the binary sequence are measured by entropy and mutual information, depending on local structure that consists of a node with a highly connected, called hub and its upstream nodes, and types of Boolean functions for the nodes. With a large number of output connections from a hub, the effects of Boolean function on the hub are more prominent. The local structures that give larger entropy tend to give rise to larger mutual information. Based on the numerical results and structural conditions we derived a time-independent transmission characteristic function of state variables for the local structures. We obtained good relationships between the numerical and analytical results, which indicate that dynamical properties from the whole networks can be inferred from the differences in the local structures. keywords: Boolean networks; power-law; coherence; mutual information; entropy; transcriptional regulatory networks Correspoding author: [email protected] Also at: Bioalgorithm Project, Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology
منابع مشابه
ar X iv : n lin / 0 51 10 57 v 1 [ nl in . C D ] 2 6 N ov 2 00 5 DISCRETE DYNAMICAL SYSTEMS EMBEDDED IN CANTOR SETS
While the notion of chaos is well established for dynamical systems on manifolds, it is not so for dynamical systems over discrete spaces with N variables, as binary neural networks and cellular automata. The main difficulty is the choice of a suitable topology to study the limit N → ∞. By embedding the discrete phase space into a Cantor set we provided a natural setting to define topological e...
متن کاملar X iv : n lin / 0 50 20 61 v 1 [ nl in . C G ] 2 6 Fe b 20 05 Two Cellular Automata for the 3 x + 1 Map
Two simple Cellular Automata, which mimic the Collatz-Ulam iterated map (3x + 1 map), are introduced. These Cellular Automata allow to test efficiently the Collatz conjecture for very large numbers.
متن کاملar X iv : 0 71 1 . 27 30 v 1 [ nl in . C G ] 1 7 N ov 2 00 7 Effects of feedback and feedforward loops on dynamics of transcriptional regulatory model networks
We demonstrate the advantages of feedforward loops using a Boolean network, which is one of the discrete dynamical models for transcriptional regulatory networks. After comparing the dynamical behaviors of network embedded feedback and feedforward loops, we found that feedforward loops can provide higher temporal order (coherence) with lower entropy (randomness) in a temporal program of gene ex...
متن کاملar X iv : c s . D M / 0 61 11 26 v 1 2 4 N ov 2 00 6 Hereditary Discrepancies in Different Numbers of Colors II
We bound the hereditary discrepancy of a hypergraph H in two colors in terms of its hereditary discrepancy in c colors. We show that herdisc(H, 2) ≤ Kcherdisc(H, c), where K is some absolute constant. This bound is sharp.
متن کاملar X iv : n lin / 0 11 10 23 v 1 [ nl in . A O ] 9 N ov 2 00 1 Evolutionary reconstruction of networks
Can a graph specifying the pattern of connections of a dynamical network be reconstructed from statistical properties of a signal generated by such a system? In this model study, we present an evolutionary algorithm for reconstruction of graphs from their Laplacian spectra. Through a stochastic process of mutations and selection, evolving test networks converge to a reference graph. Applying th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006